\documentclass[12pt, a4paper]{report}
\usepackage{graphicx}
\usepackage{color,graphics,mathpple}
\usepackage{color,graphics,graphicx,colortbl}
\usepackage{amsmath,amsfonts,amssymb}
\usepackage{amsthm,amsxtra,latexsym, amscd}
\usepackage[top=2cm,bottom=2cm,left=2.5cm, right=2cm]{geometry}
% redefine some case

\begin{document}
% make title
\title{Minimization of Deterministic Finite Automata\\
	(preliminary version)}

\author{LE Van Linh \\ NGUYEN Van Phat \\ TRAN Thanh Phu \\ TRAN Nhat Quang}
%\date{\today}
\maketitle

%make abstract
\begin{abstract}
A minimal automaton is a fundamental issue in the use and implementation of finite automata tools in frameworks like text processing, image analysis, linguistic computerscience, and many other applications. The goal of this project is to implement, test and compare the usual algorithms to minimize a deterministic finite automaton(DFA): Moore's algorithm (partition refinement) and Brzozowski's algorithm (reverse the automaton, determinize the resulting automaton, and reverse the resulting DFA).
\end{abstract}
\begin{flushleft}
 	\textbf{Acknowledgements}\\
We would like to thank Professor Anne Dicky for her support in all project. She has provided useful material, instruction analysis, deployment, project execution.\\
Thank you Professor Olivier Baudon imparted knowledge of advanced algorithms and we also thank Professor Géraud Sésnizergues taught theoretical knowledge about theory languages.
\end{flushleft}
\tableofcontents

\cleardoublepage
\addcontentsline{toc}{chapter}{List of Figures}
\listoffigures

%\chapter{Introduction}
%\setcounter{section}{0}
%\section{Basic definition}
%\subsection{Automata}
%Introduction about automata
%\subsection{Deterministic Finite Automata}
%Introduction about DFA
%\subsection{Non Deterministic Finite %Automata}
%Introduction about NFA
%\subsection{Minimize Automata}
%Introduction about minimize automata
% % % % % % % % % % % % % % % % % % % % % % %
%\section{Moore's algorithm}
%Introduction about moore's algorithm and example
\include{moore}
% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %
%\section{Brzozowski's algorithm}
\include{Brzozowski}
% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %
%\section{Hopcroft's algorithm (optional)}
%Introduction about Hopcroft's algorithm and example
% % % % % % % % % % % % % % % % % % %

\include{planning}
 
 % % % % % % % % % % % % % % % % % % % % % % %
%\chapter{Specification}
\include{Specification}
% % % % % % % % % % % % % % % % % % % % % % %
\include{Analysis}
% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %
\chapter{Implement}
No code (only write the idea of algorithm)
\chapter{Compare algorithms}
\section{Unit test}
Introduction about the data type using in implement project
\section{Comparing}
Introduction about the relations of classes
\chapter{Conclusion}

\chapter{References}
$[1]$ J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. In Proc. Sympos. Math. Theory of Automata (New York, 1962), pages 529–561. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, N.Y., 1963.\\
$[2]$ Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. Minimization of automata. Universit´e Paris-Est Marne-la-Vall´ee and Universit´e Paris Diderot, 2011.
\end{document}